Performance Assessment of Feasible Scheduling Multiprocessor Tasks Solutions by using DEA FDH method
نویسندگان
چکیده
Abstract: In this paper, an attempt has been made to investigate how DEA FDH method based on linear programming can select one or more efficient scheduling solutions on multiprocessor tasks obtained by any heuristic algorithms through some feasible solutions for NP-complete problems. This article will consider the problem of scheduling multiprocessor tasks with multi–criteria, namely, minimizing total completion time (makespan) and minimizing the number of tardy tasks and shows that most efficient schedule(s) will be determined.
منابع مشابه
Evaluation of scheduling solutions in parallel processing using DEA FDH model
This paper gives a new application of DEA to evaluate the scheduling solutions of parallel processing. It evaluates the scheduling solutions of parallel processing using the non-convex DEA model, FDH model. By introducing each solution of parallel processing scheduling as a DMU with some relevant inputs and outputs this paper shows that how the most efficient schedule(s) can be identified.
متن کاملEvaluation of scheduling solutions in parallel processing using DEA FDH model
This paper gives a new application of DEA to evaluate the scheduling solutions of parallel processing. It evaluates the scheduling solutions of parallel processing using the non-convex DEA model, FDH model. By introducing each solution of parallel processing scheduling as a DMU with some relevant inputs and outputs this paper shows that how the most efficient schedule(s) can be identified.
متن کاملFuzzy Scheduling Algorithm for Real –Time multiprocessor system
In a multiprocessor environment scheduling is very essentially done with greater challenges. Researchers are in the edge of finding solutions to these challenges. Scheduling is the art of allocating limited resources to competing tasks over time. A feasible schedule satisfies the constraints that are associated with any particular set of tasks and resources. So as to improve the performance of ...
متن کاملScheduling of a flexible flow shop with multiprocessor task by a hybrid approach based on genetic and imperialist competitive algorithms
This paper presents a new mathematical model for a hybrid flow shop scheduling problem with multiprocessor tasks in which sequence dependent set up times and preemption are considered. The objective is to minimize the weighted sum of makespan and maximum tardiness. Three meta-heuristic methods based on genetic algorithm (GA), imperialist competitive algorithm (ICA) and a hybrid approach of GA a...
متن کاملA Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study
This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012